In robotics and computer vision communities, extensive studies have been widely conducted regarding surveillance tasks, including human detection, tracking, and motion recognition with a camera. Additionally, deep learning algorithms are widely utilized in the aforementioned tasks as in other computer vision tasks. Existing public datasets are insufficient to develop learning-based methods that handle various surveillance for outdoor and extreme situations such as harsh weather and low illuminance conditions. Therefore, we introduce a new large-scale outdoor surveillance dataset named eXtremely large-scale Multi-modAl Sensor dataset (X-MAS) containing more than 500,000 image pairs and the first-person view data annotated by well-trained annotators. Moreover, a single pair contains multi-modal data (e.g. an IR image, an RGB image, a thermal image, a depth image, and a LiDAR scan). This is the first large-scale first-person view outdoor multi-modal dataset focusing on surveillance tasks to the best of our knowledge. We present an overview of the proposed dataset with statistics and present methods of exploiting our dataset with deep learning-based algorithms. The latest information on the dataset and our study are available at https://github.com/lge-robot-navi, and the dataset will be available for download through a server.

大多数现有的域自适应对象检测方法利用对抗特征对齐，以使模型适应新域。对抗性特征比对的最新进展旨在减少发生的负面影响或负转移的负面影响，因为特征的分布取决于对象类别。但是，通过分析无锚的一阶段检测器的特征，在本文中，我们发现可能发生负转移，因为特征分布取决于对边界框的回归值以及类别的回归值而变化。为了通过解决此问题来获得域的不变性，我们考虑了特征分布的模式，以偏移值为条件。通过一种非常简单有效的调节方法，我们提出了在各种实验环境中实现最新性能的OADA（偏置感知域自适应对象检测器）。此外，通过通过单数值分析分析，我们发现我们的模型可以增强可区分性和可传递性。

关键字斑点（KWS）在启用智能设备上的基于语音的用户互动方面起着至关重要的作用，而常规KWS（C-KWS）方法集中在检测用户无关的预定关键字上。但是，实际上，大多数用户互动都来自该设备中注册的目标用户，这些用户激发了构建个性化关键字发现的设备。我们设计了两个个性化的KWS任务； （1）目标用户偏置KWS（TB-KWS）和（2）仅目标用户KWS（TO-KWS）。为了解决任务，我们通过多任务学习（PK-MTL）提出个性化关键字，该关键字可以通过多任务学习和任务适应为组成。首先，我们介绍对关键字发现和扬声器验证的多任务学习，以利用用户信息到关键字发现系统。接下来，我们设计特定于任务的评分功能，以彻底适应个性化的KWS任务。我们在常规和个性化场景上评估了框架，结果表明，PK-MTL可以大大降低错误警报率，尤其是在各种实际情况下。

关键字发现是检测流音频中的关键字的任务。传统的关键字点斑点目标预定义的关键字分类，但是越来越多的关键字（逐示例）关键字点斑点，例如，N-Way分类给出了M-Shot支持样本。此外，在现实世界中，可能会有意外类别（开放设定）的话语需要被拒绝，而不是归类为N类之一。结合了两个需求，我们将几个开放式关键字点斑点与名为SplitGSC的新基准设置进行了处理。我们提出了基于公制学习的情节 - 已知的虚拟原型，以更好地检测开放式设定，并引入一种简单而强大的方法，虚拟原型网络（D-Protonets）。与最新的SplitGSC中的几个射击开放式识别（FSOSR）方法相比，我们的D-Protonets显示出明显的边缘。我们还可以在标准基准测试中验证我们的方法，微型果胶和D-Protonets显示了FSOSR中最新的开放式检测率。

最近的端到端多对象检测器通过删除手工制作的过程（例如使用非最大最大抑制（NMS））删除手工制作的过程来简化推理管道。但是，在训练中，他们需要两分匹配来计算检测器输出的损失。与端到端学习的核心的方向性相反，双方匹配使端到端探测器复杂，启发式和依赖的培训。在本文中，我们提出了一种训练端到端多对象探测器而无需匹配的方法。为此，我们使用混合模型将端到端多对象检测作为密度估计问题。我们提出的检测器，称为稀疏混合物密度检测器（稀疏MDOD），使用混合模型估算边界盒的分布。稀疏MDOD是通过最大程度地减少负对数似然性和我们提出的正则化项，最大成分最大化（MCM）损失来训练的，从而阻止了重复的预测。在训练过程中，不需要其他过程，例如两分匹配，并且损失是直接从网络输出中计算出来的。此外，我们的稀疏MDOD优于MS-Coco上的现有检测器，MS-Coco是一种著名的多对象检测基准。

Many recent works on understanding deep learning try to quantify how much individual data instances influence the optimization and generalization of a model, either by analyzing the behavior of the model during training or by measuring the performance gap of the model when the instance is removed from the dataset. Such approaches reveal characteristics and importance of individual instances, which may provide useful information in diagnosing and improving deep learning. However, most of the existing works on data valuation require actual training of a model, which often demands high-computational cost. In this paper, we provide a training-free data valuation score, called complexity-gap score, which is a data-centric score to quantify the influence of individual instances in generalization of two-layer overparameterized neural networks. The proposed score can quantify irregularity of the instances and measure how much each data instance contributes in the total movement of the network parameters during training. We theoretically analyze and empirically demonstrate the effectiveness of the complexity-gap score in finding 'irregular or mislabeled' data instances, and also provide applications of the score in analyzing datasets and diagnosing training dynamics.

Crowdsourcing has emerged as an effective platform to label a large volume of data in a cost- and time-efficient manner. Most previous works have focused on designing an efficient algorithm to recover only the ground-truth labels of the data. In this paper, we consider multi-choice crowdsourced labeling with the goal of recovering not only the ground truth but also the most confusing answer and the confusion probability. The most confusing answer provides useful information about the task by revealing the most plausible answer other than the ground truth and how plausible it is. To theoretically analyze such scenarios, we propose a model where there are top-two plausible answers for each task, distinguished from the rest of choices. Task difficulty is quantified by the confusion probability between the top two, and worker reliability is quantified by the probability of giving an answer among the top two. Under this model, we propose a two-stage inference algorithm to infer the top-two answers as well as the confusion probability. We show that our algorithm achieves the minimax optimal convergence rate. We conduct both synthetic and real-data experiments and demonstrate that our algorithm outperforms other recent algorithms. We also show the applicability of our algorithms in inferring the difficulty of tasks and training neural networks with the soft labels composed of the top-two most plausible classes.

Large language models (LLMs) have demonstrated impressive capabilities in natural language understanding and generation, but the quality bar for medical and clinical applications is high. Today, attempts to assess models' clinical knowledge typically rely on automated evaluations on limited benchmarks. There is no standard to evaluate model predictions and reasoning across a breadth of tasks. To address this, we present MultiMedQA, a benchmark combining six existing open question answering datasets spanning professional medical exams, research, and consumer queries; and HealthSearchQA, a new free-response dataset of medical questions searched online. We propose a framework for human evaluation of model answers along multiple axes including factuality, precision, possible harm, and bias. In addition, we evaluate PaLM (a 540-billion parameter LLM) and its instruction-tuned variant, Flan-PaLM, on MultiMedQA. Using a combination of prompting strategies, Flan-PaLM achieves state-of-the-art accuracy on every MultiMedQA multiple-choice dataset (MedQA, MedMCQA, PubMedQA, MMLU clinical topics), including 67.6% accuracy on MedQA (US Medical License Exam questions), surpassing prior state-of-the-art by over 17%. However, human evaluation reveals key gaps in Flan-PaLM responses. To resolve this we introduce instruction prompt tuning, a parameter-efficient approach for aligning LLMs to new domains using a few exemplars. The resulting model, Med-PaLM, performs encouragingly, but remains inferior to clinicians. We show that comprehension, recall of knowledge, and medical reasoning improve with model scale and instruction prompt tuning, suggesting the potential utility of LLMs in medicine. Our human evaluations reveal important limitations of today's models, reinforcing the importance of both evaluation frameworks and method development in creating safe, helpful LLM models for clinical applications.

The nonconvex formulation of matrix completion problem has received significant attention in recent years due to its affordable complexity compared to the convex formulation. Gradient descent (GD) is the simplest yet efficient baseline algorithm for solving nonconvex optimization problems. The success of GD has been witnessed in many different problems in both theory and practice when it is combined with random initialization. However, previous works on matrix completion require either careful initialization or regularizers to prove the convergence of GD. In this work, we study the rank-1 symmetric matrix completion and prove that GD converges to the ground truth when small random initialization is used. We show that in logarithmic amount of iterations, the trajectory enters the region where local convergence occurs. We provide an upper bound on the initialization size that is sufficient to guarantee the convergence and show that a larger initialization can be used as more samples are available. We observe that implicit regularization effect of GD plays a critical role in the analysis, and for the entire trajectory, it prevents each entry from becoming much larger than the others.

Hinged on the representation power of neural networks, neural radiance fields (NeRF) have recently emerged as one of the promising and widely applicable methods for 3D object and scene representation. However, NeRF faces challenges in practical applications, such as large-scale scenes and edge devices with a limited amount of memory, where data needs to be processed sequentially. Under such incremental learning scenarios, neural networks are known to suffer catastrophic forgetting: easily forgetting previously seen data after training with new data. We observe that previous incremental learning algorithms are limited by either low performance or memory scalability issues. As such, we develop a Memory-Efficient Incremental Learning algorithm for NeRF (MEIL-NeRF). MEIL-NeRF takes inspiration from NeRF itself in that a neural network can serve as a memory that provides the pixel RGB values, given rays as queries. Upon the motivation, our framework learns which rays to query NeRF to extract previous pixel values. The extracted pixel values are then used to train NeRF in a self-distillation manner to prevent catastrophic forgetting. As a result, MEIL-NeRF demonstrates constant memory consumption and competitive performance.